On the index of bicyclic graphs with perfect matchings
نویسندگان
چکیده
Let B(2k) be the set of all bicyclic graphs on 2k(k¿ 2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with maximal index in B(2k). c © 2004 Elsevier B.V. All rights reserved. MSC: 05c50
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملOn the Signless Laplacian Spectral Radius of Bicyclic Graphs with Perfect Matchings
The graph with the largest signless Laplacian spectral radius among all bicyclic graphs with perfect matchings is determined.
متن کاملExtremal Bicyclic Graph with Perfect Matching for Different Indices
Let B(2m,m) be the set of all bicyclic graphs on 2m(m ≥ 2) vertices with perfect matchings. In this paper, we characterize the bicyclic graphs with minimal number of matchings and maximal number of independent sets in B(2m,m). 2010 Mathematics Subject Classification: 05C69, 05C05
متن کاملOn the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 283 شماره
صفحات -
تاریخ انتشار 2004